
Electronics Research Engineer/Physicist in Particle Physics
 City of Bristol
 £35,609  £40,082
Applications are invited for the position of Electronics Research Engineer or Physicist....
 Recruiter: University of Bristol

ILS Engineer
 Cowes, Isle of Wight
 Competitive
You will be a crucial part of the programme which is designing, developing, and manufacturing cutting edge radar technology for the Royal Navy.
 Recruiter: BAE Systems

Principal RF/ Analogue Engineer
 Cowes, Isle of Wight
 Competitive
You will be working on a range of long term development projects at various stages in the engineering life cycle
 Recruiter: BAE Systems

Systems Analyst
 Cowes, Isle of Wight
 £25,000+ depending on experience
You will be working on the development of a number of cutting edge technology programmes such as the Artisan and Sampson radars.
 Recruiter: BAE Systems

Systems Engineer – (Development opportunity)
 Cowes, Isle of Wight
 Competitive
Would you like to develop your career within radar systems development?
 Recruiter: BAE Systems

Principal Engineer  SSBN Communications
 Frimley
 Competitive
As a Principal Engineer  SSBN Communications, you will be working at the forefront of submarine communications.
 Recruiter: BAE Systems

Electronics/Communications Engineer to train as a Patent Attorney
 London and Cambridge
 Graduate salaries start at around £29K, and rise to £50K and above post qualification.
Your engineering degree could open the door to a career in intellectual property as a trainee patent attorney.
 Recruiter: Reddie & Grose LLP

Professor and Head of the Department of Electronic and Electrical Engineering
 London (Greater)
Consistently ranked among the world’s top universities, UCL is a modern.....
 Recruiter: UCL

TECHNICAL SUPPORT ASSISTANT
 Perth, Perth and Kinross
 £23,349 to £30,840 DEPENDING ON SKILLS AND EXPERIENCE
Our Network Management Centre (NMC) North is responsible for the management and control of SHEPD’s high voltage Distribution system. Your role in this
 Recruiter: SSE

Systems Engineer
 Birmingham, West Midlands
 £43,000
Virgin Trains is the only UK TOC to operate a fleet of tilting trains and the Fleet Management Group’s (FMG) job is....
 Recruiter: Virgin Trains
Algorithm to drastically speed up mapping of Internet
The increasing complexity of networks in the modern world has put limitations on the usefulness of traditional "max flow" algorithms
A new theoretical algorithm could vastly simplify methods for finding the most efficient route across complex networks like the Internet.
Mathematicians and computer scientists have wrestled with problems such as finding the most efficient way to transport items across networks like highway systems or the Internet for decades, traditionally using a maximumflow algorithm, also known as "max flow".
In a maxflow algorithm the network is represented as a graph with a series of nodes, known as vertices, and connecting lines between them, called edges, which each have a maximum capacity — just like roads or fibreoptic cables.
These algorithms attempt to find the most efficient way to send goods from one node in the graph to another, without exceeding the capacity constraints.
But as the size of networks like the Internet has grown exponentially it has become prohibitively timeconsuming to solve these problems using traditional computing techniques, according to Jonathan Kelner, an associate professor of applied mathematics at MIT and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL).
In response, Kelner and his team have created a new theoretical algorithm that can dramatically reduce the number of operations needed to solve the maxflow problem, making it possible to tackle even huge networks like the Internet or the human genome.
"There has recently been an explosion in the sizes of graphs being studied," Kelner said. "For example, if you wanted to route traffic on the Internet, study all the connections on Facebook, or analyse genomic data, you could easily end up with graphs with millions, billions or even trillions of edges."
In a paper to be presented at the ACMSIAM Symposium on Discrete Algorithms in the USA this week, Kelner and his colleague Lorenzo Orecchia, an applied mathematics instructor, alongside graduate students Yin Tat Lee and Aaron Sidford, describe how have abandoned the methods of previous maxflow algorithms, which have come at the problem one edge, or path, at a time.
"Many previous algorithms would find a path from point A to point B, send some flow along it, and then say, 'Given what I've already done, can I find another path along which I can send more?' When one needs to send flow simultaneously along many different paths, this leads to an intrinsic limitation on the speed of the algorithm," said Kelner.
But in 2011 Kelner, CSAIL graduate student Aleksander Madry, mathematics undergraduate Paul Christiano, and colleagues at Yale University and the University of Southern California developed a technique to analyse all of the paths simultaneously by viewing the graph as a collection of electrical resistors.
The researchers imagined connecting a battery to node A and a ground to node B, and allowing the current to flow through the network.
"Electrical current doesn't pick just one path, it will send a little bit of current over every resistor on the network," Kelner said. "So it probes the whole graph globally, studying many paths at the same time."
This breakthrough allowed the new algorithm to solve the maxflow problem substantially faster than previous attempts, and now the MIT team has developed a technique to reduce the running time even further, making it possible to analyse even gigantic networks, Kelner says.
Unlike previous algorithms, which have viewed all the paths within a graph as equals, the new technique identifies those routes that create a bottleneck within the network. The team's algorithm divides each graph into clusters of wellconnected nodes, and the paths between them that create bottlenecks, Kelner says.
"Our algorithm figures out which parts of the graph can easily route what they need to, and which parts are the bottlenecks,” he says. “This allows you to focus on the problem areas and the highlevel structure, instead of spending a lot of time making unimportant decisions, which means you can use your time a lot more efficiently.”
The result is an almost linear algorithm, Kelner says, meaning the amount of time it takes to solve a problem is very close to being directly proportional to the number of nodes on the network.
So if the number of nodes on the graph is multiplied by 10, the amount of time would be multiplied by something very close to 10, as opposed to being multiplied by 100 or 1,000, he says.
"This means that it scales essentially as well as you could hope for with the size of the input," he added.
Latest Issue
"DoItYourself in technology is becoming a quietly subversive act against prescriptive globalisation, as well as a general force for good"
News
Most viewed
 Microsoft upgrades headset for blind people
 Cashregister malware is the ‘most complex ever seen’
 Spending review: science budgets protected, energy efficiency measures cut
 Formula E announces driverless electric car championship
 Solar power sharing scheme launched in Germany
 UK gives up on carbon capture and storage