valia

Proof engineering, from the Four Color to the Odd Order Theorem by Dr Georges Gonthier

Thirty five years ago computers made a dramatic debut in mathematics with the famous proof of the Four Color Theorem by Appel and Haken. Their role has been expanding recently, from computational devices to tools that can tackle deduction and proofs too complex for (most) human minds, such as the Kepler conjecture or the Classification Proof engineering, from the Four Color to the Odd Order Theorem by Dr Georges Gonthier

Evolution of Radio Access Networks: Lighting up IQ by Francisco J. Garcia, Agilent Technologies

In this talk we will introduce how new mobile base station architectures are evolving not only to meet demand but also to become “greener” since at current rates of deployment, mobile networks are becoming very large CO2 contributors. These new base station architectures are also becoming enablers for new Radio Access Networks (RANs) where the Evolution of Radio Access Networks: Lighting up IQ by Francisco J. Garcia, Agilent Technologies

A Decade of Research on Constraint Modelling and Reformulation:The Quest for Abstraction and Automation by Alan M Frisch

Abstract: To mark the Tenth International Workshop on Constraint Modelling and Reformulation, this talk reviews research in the field over the past decade, focusing on the key themes of abstraction and automation. Looking to the future, the talk identifies key issues that must be confronted in furthering the quest for abstraction and automation. Biography: Dr A Decade of Research on Constraint Modelling and Reformulation:The Quest for Abstraction and Automation by Alan M Frisch

ParaForming: Forming Parallel Haskell Programs using Novel Refactoring Techniques by Prof Kevin Hammond

Abstract Despite Moore’s “law”, uniprocessor clock speeds have now stalled. Rather than using single processors running at ever higher clock speeds, it is common to find dual-, quad- or even hexa-core processors, even in consumer laptops and desktops. Future hardware will not be slightly parallel, however, as in today’s multicore systems, but will be massively ParaForming: Forming Parallel Haskell Programs using Novel Refactoring Techniques by Prof Kevin Hammond

Friendlists, Followers and Contacts: Using Self-Reported Social Networks to Improve Opportunistic Networks by Gregory Bigwood

Abstract: Opportunistic networks provide an ad hoc communication medium without the need for an infrastructure network, by leveraging human encounters and mobile devices. Routing protocols in opportunistic networks frequently rely upon encounter histories to build up meaningful data to use for informed routing decisions. This seminar presents work showing it is possible to use pre-existing Friendlists, Followers and Contacts: Using Self-Reported Social Networks to Improve Opportunistic Networks by Gregory Bigwood