Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Assembly: Physics of Manufacturing

In course

MICRO-301: Manufacturing technologies

This course gives an introduction to production methods and manufacturing technologies used in microengineering. The focus is given on the understanding of physical phenomena underlying the processes, the relation between materials, manufacturing processes ...

Description

This lecture covers the importance of assembly in manufacturing, including the need for precise positioning, aligning elements, and controlling degrees of freedom. It discusses common couplings, stability, spatial vectors, force, and graph theory in the context of assembly.

This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.

Watch on Mediaspace

Instructors (2)

Yves Bellouard

Dr. Yves Bellouard is Associate Professor in Microengineering at Ecole Polytechnique Fédérale de Lausanne (EPFL) in Switzerland, where he heads the Galatea lab and the Richemont Chair in micromanufacturing. He received a BS in Theoretical Physics and a MS in Applied Physics from Université Pierre et Marie Curie in Paris, France in 1994-1995 and a PhD in Microengineering from Ecole Polytechnique Fédérale de Lausanne (EPFL) in Lausanne, Switzerland in 2000. For his PhD work, he received the Omega Scientific prize (2001) for outstanding contribution in the field of microengineering for his work on Shape Memory Alloys. Before joining EPFL in 2015, he was Associate Professor at Eindhoven University of Technologies (TU/e) in the Netherlands and prior to that, Research Scientist at Rensselaer Polytechnic Institute (RPI) in Troy, New York for about four years where he started working on femtosecond laser processing of glass materials. From 2010 until 2013, Yves Bellouard initiated and coordinated the Femtoprint project, a European research initiative aiming at investigating a table-top printer for microsystems ('3D printing of microsystems'). In 2013, he received a prestigious ERC Starting Grant (Consolidator-2012) from the European Research Council and a JSPS Fellowship from the Japan Society for the Promotion of Science. His current research interests are on new paradigms for system integration at the microscale and in particular laser-based methods to tailor material properties for achieving higher level of integration in microsystems, like for instance integrating optics, mechanics and fluidics in a single monolith. These approaches open new opportunities for direct-write methods of microsystems (3D printing). Personal website

Vivek Subramanian

Official source

Ontological neighbourhood

Mathematics

Discrete mathematics: Graph theory

Related concepts (31)

Graph theory

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices (also called nodes or points) which are connected by edges (also called links or lines). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics.

Glossary of graph theory

This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges.

Connectivity (graph theory)

In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to separate the remaining nodes into two or more isolated subgraphs. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v.

Path (graph theory)

In graph theory, a path in a graph is a finite or infinite sequence of edges which joins a sequence of vertices which, by most definitions, are all distinct (and since the vertices are distinct, so are the edges). A directed path (sometimes called dipath) in a directed graph is a finite or infinite sequence of edges which joins a sequence of distinct vertices, but with the added restriction that the edges be all directed in the same direction. Paths are fundamental concepts of graph theory, described in the introductory sections of most graph theory texts.

Vertex (graph theory)

In discrete mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices). In a diagram of a graph, a vertex is usually represented by a circle with a label, and an edge is represented by a line or arrow extending from one vertex to another.

Related lectures (36)

Networked Control Systems: Opportunities

Explores coordination in networked control systems, graph theory, and consensus algorithms.

Graph Algorithms II: Traversal and Paths

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Cavity Method: Mean Field Theory

Explores the Cavity Method in Mean Field Theory, analyzing spins in an external field within a graph.

Belief Propagation

Explores Belief Propagation in graphical models, factor graphs, spin glass examples, Boltzmann distributions, and graph coloring properties.

Unweighted Bipartite Matching

Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.