skip to content

NanoManufacturing

Michael De Volder, Engineering Department - IfM
 
Subscribe to http://talks.cam.ac.uk/show/rss/5408 feed
This is a superlist of research seminars in Cambridge open to all interested researchers. Weekly extracts of this list (plus additional talks not yet on talks.cam) are emailed to a distribution list of over 200 Cambridge researchers by Research Services Division. To join the list click here https://lists.cam.ac.uk/mailman/listinfo/biophy-cure For more information see http://www.cure.group.cam.ac.uk or email drs45[at]rsd.cam.ac.uk
Updated: 6 hours 14 min ago

Wed 15 Oct 16:00: Title to be confirmed

Wed, 17/09/2025 - 10:50
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Thu 25 Sep 10:00: Proximity Gaps for Multilinear Interactive Oracle Proofs

Tue, 16/09/2025 - 21:13
Proximity Gaps for Multilinear Interactive Oracle Proofs

A set displays a (delta, gamma)-proximity gap to a linear code, C, if either all elements are delta-close in relative Hamming distance to a codeword in C or only gamma of them are. Proximity gaps of the set A_{v,u} := {v + r u : r in F }, for fixed vectors v,u, are fundamental to the security and efficiency of an extremely efficient family of Interactive Oracle Proofs (IOPs) from FRI (ICALP 2018), where larger delta implies more efficient verifiers and smaller gamma implies more efficient provers.

Building on FRI , the authors of BaseFold (Crypto 2024) introduced a new family of IOPs with concretely faster provers. However, BaseFold additionally requires that if all elements of A_{v,u} are close to the code, then they all agree with their respective nearest codewords in a fixed, shared set of locations.

We prove this to be true for all linear codes when delta < 1 – (1 – Delta + epsilon)^{1/3} – eta and gamma < 1/(epsilon eta) (where Delta is the relative minimum distance of the code). This improves the previous bound of delta < 1 – (1 – Delta/3) – eta from BaseFold, and it recovers the original proximity gaps result for linear codes, which is proven to be tight in DEEP -FRI (ITCS 2020).

link to paper: https://eprint.iacr.org/2024/1843.pdf

Add to your calendar or Include in your list

Fri 03 Oct 14:00: On Solution Discovery via Reconfiguration

Tue, 16/09/2025 - 14:53
On Solution Discovery via Reconfiguration

The dynamics of real-world applications and systems require efficient methods for improving infeasible solutions or restoring corrupted ones by making modifications to the current state of a system in a restricted way. We propose a new framework of solution discovery via reconfiguration for constructing a feasible solution for a given problem by executing a sequence of small modifications starting from a given state. Our framework integrates different aspects of classical local search, reoptimization, and combinatorial reconfiguration. We exemplify our framework on a multitude of fundamental combinatorial problems. We study the classical as well as the parameterized complexity of the solution discovery variants of those problems and explore the boundary between tractable and intractable instances.

Add to your calendar or Include in your list

Wed 15 Oct 13:00: Bradford Hill Seminar – The politics of epidemiology and public health in the UK - Professor Danny Dorling

Tue, 16/09/2025 - 14:50
Bradford Hill Seminar – The politics of epidemiology and public health in the UK - Professor Danny Dorling

All are invited to the hybrid Bradford Hill Seminar ‘The politics of epidemiology and public health in the UK’ with Professor Danny Dorling of the University of Oxford.

Attend in person or register to attend online at https://mrc-epid.zoom.us/meeting/register/Xt6c2C_hR7a2xOFqlKb5Dg

We like to present epidemiology as politically neutral, and public health as the science of supporting the health of the population as a whole. This is not necessarily so.

There are always choices to be made. Different academic disciplines have implicit biases and underlying beliefs, which can change over time and differ greatly between contexts. Some of the most obvious examples are between people who prefer individualistic explanations and those who see this as victim blaming.

A lack of attention to certain topics is another form of political bias. Why, for instance, are we in the UK not more concerned about how many people choose and can afford to use private health care and dentistry? Why are we not talking about how life expectancy fell in the UK after 2014? And, to what extent is our epidemiology and public health in the UK in the 2020s a reflection of UK politics?

About Professor Dorling: Danny Dorling works at the University of Oxford. His most recent three books are: “Seven Children”, “Peak Injustice”, and “The Next Crisis”. He works with road crash charity RoadPeace, Heeley City Farm in Sheffield, and the educational campaign group Comprehensive Future.

Add to your calendar or Include in your list

Thu 25 Sep 13:00: TBC Note unusual time

Tue, 16/09/2025 - 12:51
TBC

Hosted by Professor Ravi Gupta, Professor of Clinical Microbiology, CITIID , Department of Medicine

Note unusual time

Add to your calendar or Include in your list

Thu 25 Sep 13:00: TBC

Tue, 16/09/2025 - 12:32
TBC

Abstract not available

Add to your calendar or Include in your list

Thu 26 Feb 14:00: Title to be confirmed

Tue, 16/09/2025 - 12:21
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Thu 20 Nov 15:00: Challenges and opportunities in understanding the dynamic behaviour of engineering materials under complex loading paths

Tue, 16/09/2025 - 11:11
Challenges and opportunities in understanding the dynamic behaviour of engineering materials under complex loading paths

In the automotive and transportation sectors, engineering materials are frequently subjected to impulsive loading during collision events. Understanding their behaviour under such conditions is essential for designing safer, more impact-resilient structures. However, current research often overlooks critical factors, such as the combined influence of complex loading paths, strain rate, and environmental conditions.

This seminar will explore two key areas: (i) state-of-the-art experimental techniques for investigating the behaviour of lightweight materials under complex loading and environmental conditions; and (ii) the potential of controlling stress wave synchronisation and timing, alongside data-driven modelling approaches.

Add to your calendar or Include in your list

Wed 01 Oct 14:00: Efficient gradient coding for mitigating stragglers within distributed machine learning

Mon, 15/09/2025 - 22:36
Efficient gradient coding for mitigating stragglers within distributed machine learning

Please note that the room is different from the usual one.

Large scale distributed learning is the workhorse of modern-day machine learning algorithms. A typical scenario consists of minimizing a loss function (depending on the dataset) with respect to high-dimensional parameter. Workers typically compute gradients on their assigned dataset chunks and send them to the parameter server (PS), which aggregates them to compute either an exact or approximate version of the overall gradient of the relevant loss function. However, in large-scale clusters, many workers are prone to straggling (are slower than their promised speed or even failure-prone). A gradient coding solution introduces redundancy within the assignment of chunks to the workers and uses coding theoretic ideas to allow the PS to recover the overall gradient (exactly or approximately), even in the presence of stragglers. Unfortunately, most existing gradient coding protocols are inefficient from a computation perspective as they coarsely classify workers as operational or failed; the potentially valuable work performed by slow workers (partial stragglers) is ignored.

In this talk we will give an overview of some of our recent work in this area that addresses these limitations. Specifically, we will present novel gradient coding protocols that judiciously leverage the work performed by partial stragglers. Our protocols are simultaneously efficient from both a computation and communication perspective and numerically stable. For an important class of chunk assignments, we present efficient algorithms for optimizing the relative ordering of chunks within the workers; this ordering affects the overall execution time. For exact gradient reconstruction, our protocol is around 2x faster than the original class of protocols and for approximate gradient reconstruction, the mean-squared-error of our reconstructed gradient is several orders of magnitude better.

Bio: Aditya Ramamoorthy is the John Ryder Professor of Electrical and Computer Engineering and (by courtesy) of Mathematics at Iowa State University. He received his B. Tech. degree in Electrical Engineering from the Indian Institute of Technology, Delhi and the M.S. and Ph.D. degrees from the University of California, Los Angeles (UCLA). His research interests are in the areas of classical/quantum information theory and coding techniques with applications to distributed computation, content distribution networks and machine learning.

Dr. Ramamoorthy currently serves as an editor for the IEEE Transactions on Information Theory (previous term from 2016—2019) and the IEEE Transactions on Communications from 2011—2015. He is the recipient of the Northrop Grumman professorship (2022-24), the 2020 Mid-Career Achievement in Research Award, the 2019 Boast-Nilsson Educational Impact Award and the 2012 Early Career Engineering Faculty Research Award from Iowa State University, the 2012 NSF CAREER award, and the Harpole-Pentair professorship in 2009-2010.

Add to your calendar or Include in your list

Mon 27 Oct 16:15: Conscious visual perception, perceptual organization and how to restore it in blindness

Mon, 15/09/2025 - 16:22
Conscious visual perception, perceptual organization and how to restore it in blindness

Abstract not available

Add to your calendar or Include in your list

Mon 20 Oct 16:15: Visual cortex gamma reflects stimulus experience and stimulus reward value

Mon, 15/09/2025 - 16:20
Visual cortex gamma reflects stimulus experience and stimulus reward value

Abstract not available

Add to your calendar or Include in your list

Mon 13 Oct 16:15: Plasticity of the Parental Brain

Mon, 15/09/2025 - 16:16
Plasticity of the Parental Brain

Abstract not available

Add to your calendar or Include in your list

Fri 07 Nov 16:00: Parton showers beyond leading colour

Mon, 15/09/2025 - 14:54
Parton showers beyond leading colour

General purpose parton showers are based on classical branching algorithms. As a result, it is not possible to account for even the leading quantum interference effects in general scattering processes and this often limits the accuracy of these showers to the leading colour approximation. We have developed the CVolver Monte Carlo code, which is able to evolve a density matrix to a prescribed accuracy in colour. This means we are able to account for wide-angle, soft-gluon physics systematically in 1/N where N=3 is the number of colours. This is the first time such a systematic resummation has been performed for general processes and in this talk I will report on the latest results.

Add to your calendar or Include in your list

Fri 24 Oct 16:00: TBA

Mon, 15/09/2025 - 14:53
TBA

Abstract not available

Add to your calendar or Include in your list

Fri 17 Oct 16:00: TBA

Mon, 15/09/2025 - 14:51
TBA

Abstract not available

Add to your calendar or Include in your list

Fri 10 Oct 16:00: TBA

Mon, 15/09/2025 - 14:50
TBA

Abstract not available

Add to your calendar or Include in your list

Fri 24 Oct 16:00: TBA

Mon, 15/09/2025 - 12:06
TBA

Abstract not available

Add to your calendar or Include in your list

Latest news

We are hiring!

4 January 2021

We are seeking to hire a research assistant to work on carbon nanotube based microdevices. More information is available here: www.jobs.cam.ac.uk/job/28202/

We are Hiring!

4 January 2021

We are seeking to hire a postdoc researcher to work on the structuring of Li-ion battery electrodes. More information is available here: www.jobs.cam.ac.uk/job/28197/