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: 5 days 8 hours ago

Fri 06 Jun 16:00: Title to be confirmed

Tue, 08/04/2025 - 10:52
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Fri 30 May 16:00: Title to be confirmed

Tue, 08/04/2025 - 10:46
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Fri 23 May 16:00: Title to be confirmed

Tue, 08/04/2025 - 10:45
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Fri 16 May 16:00: Title to be confirmed

Tue, 08/04/2025 - 10:43
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Fri 09 May 16:00: Title to be confirmed

Tue, 08/04/2025 - 10:42
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Wed 07 May 15:05: The TPTP World - Infrastructure for Automated Reasoning

Tue, 08/04/2025 - 09:42
The TPTP World - Infrastructure for Automated Reasoning

The TPTP World is the established infrastructure used by the Automated Theorem Proving (ATP) community for research, development, and deployment of ATP systems. The data, standards, and services provided by the TPTP World have made it easy to develop, evaluate, and deploy ATP technology. This talk and tutorial reviews the core features of the TPTP World, describes key services of the TPTP World, and presents some successful applications. The use of ATP as the reliable substrate to subsymbolic AI systems (e.g., LLMs), to form neurosymbolic AI systems, is reviewed.

Link to join virtually: https://cam-ac-uk.zoom.us/j/87421957265

This talk is being recorded. If you do not wish to be seen in the recording, please avoid sitting in the front three rows of seats in the lecture theatre. Any questions asked will also be included in the recording. The recording will be made available on the Department’s webpage

Add to your calendar or Include in your list

Wed 23 Apr 11:00: Equality Saturation and Industrial Circuit Design

Mon, 07/04/2025 - 20:23
Equality Saturation and Industrial Circuit Design

In this talk I’ll give a brief background on e-graphs and equality saturation, attempting to distill the reasons behind the significant interest in this approach. I’ll then present my research, in collaboration with Intel, into high-performance circuit design exploring how equality saturation can help us to design efficient computational circuits. Lastly I will outline the goals for my short time in Cambridge, contributing to the CIRCT project.

Bio: Sam Coward originally completed a maths degree at Cambrigdge, but has since moved into digitial circuit design. His PhD at Imperial College London with Prof. George Constantinides primarily explored how to leverage and extend equality saturation to automate arithmetic circuit design and verification. He has recently joined Tobias Grosser’s group in Cambridge for a short post-doc.

Add to your calendar or Include in your list

Fri 13 Jun 14:30: Title to be confirmed

Mon, 07/04/2025 - 15:55
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Wed 07 May 14:00: Graph Data Compression: Practical Methods and Information-Theoretic Limits

Mon, 07/04/2025 - 14:13
Graph Data Compression: Practical Methods and Information-Theoretic Limits

Many modern datasets possess complex correlation structures. Such data is typically stored as graphs. Examples of graph data include social networks, web graphs, biological networks, and neural networks. These graph datasets often contain hundreds of millions of nodes and billions of edges, which leads to a significant problem in terms of storage and processing. Therefore, there is need to compress graphs and store them efficiently without losing much information. In this talk, I will give an introduction to the developing field of graph compression. I will discuss the basic problems encountered in practice and some of the solutions that have been proposed. I will also present a few results detailing information theoretic limits on compressing graphs.

Add to your calendar or Include in your list

Fri 02 May 12:00: Asymmetry in Supposedly Equivalent Facts: Pre-training Bias in Large Language Models

Mon, 07/04/2025 - 13:48
Asymmetry in Supposedly Equivalent Facts: Pre-training Bias in Large Language Models

Understanding and mitigating hallucinations in Large Language Models (LLMs) is crucial for ensuring reliable content generation. While previous research has primarily focused on “when” LLMs hallucinate, our work explains “why” and directly links model behaviour to the pre-training data that forms their prior knowledge. Specifically, we demonstrate that an asymmetry exists in the recognition of logically equivalent facts, which can be attributed to frequency discrepancies of entities appearing as subjects versus objects. Given that most pre-training datasets are inaccessible, we leverage the fully open-source OLMo series by indexing its Dolma dataset to estimate entity frequencies. Using relational facts (represented as triples) from Wikidata5M, we construct probing datasets to isolate this effect. Our experiments reveal that facts with a high-frequency subject and a low-frequency object are better recognised than their inverse, despite their logical equivalence. The pattern reverses in low-to-high frequency settings, and no statistically significant asymmetry emerges when both entities are high-frequency. These findings underscore the influential role of pre-training data in shaping model predictions and provide insights for inferring the characteristics of pre-training data in closed or partially closed LLMs.

Add to your calendar or Include in your list

Fri 30 May 12:00: Title to be confirmed

Mon, 07/04/2025 - 13:48
Title to be confirmed

Abstract not available

Add to your calendar or Include in your list

Mon 19 May 14:30: From Einstein’s doubts to quantum technologies: non-locality in action

Mon, 07/04/2025 - 13:43
From Einstein’s doubts to quantum technologies: non-locality in action

As pointed out by Einstein, and confirmed by the violation of Bell’s inequalities, entanglement of separated particles is an extraordinary feature of quantum mechanics, suggesting some kind of non-locality. It is now used in quantum technologies.

After presenting the Einstein Bohr debate and Bell’s inequalities with their experimental tests, I will show how the notion of non-locality provides fruitful intuitions for some quantum communication methods.

Add to your calendar or Include in your list

Fri 09 May 16:00: Resummation of Non-Global Logarithms

Mon, 07/04/2025 - 11:10
Resummation of Non-Global Logarithms

An intricate pattern of enhanced higher-order corrections known as non-global logarithms arises in cross sections with angular cuts. While the leading logarithmic terms have been calculated numerically more than two decades ago, the resummation of subleading non-global logarithms remained an open problem. In this seminar, I will present a solution to this challenge using effective field theory techniques. Starting from a factorization theorem, we develop a dedicated parton shower framework in the Veneziano limit where the number of colors Nc becomes large, but the ratio of Nc to the number of fermion flavors nF remains fixed. We solve the associated renormalization-group equations using the Monte-Carlo framework MARZILI , thereby resumming the subleading non-global logarithms. To demonstrate the validity of our approach, we will show results of an ongoing comparison between MARZILI , GNOLE and PanScales.

Add to your calendar or Include in your list

Fri 16 May 16:00: TBA

Mon, 07/04/2025 - 11:10
TBA

Abstract not available

Add to your calendar or Include in your list

Fri 02 May 16:00: TBA

Mon, 07/04/2025 - 11:05
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/